Constructing ω-stable Structures: Rank k-fields
نویسندگان
چکیده
منابع مشابه
Constructing ω-stable Structures: Model Completeness
The projective plane of [2] is model complete in a language with additional constant symbols. The infinite rank bicolored field of [14] is not model complete. The finite rank bicolored fields of [4, 6] are model complete. More generally, the finite rank expansions of a strongly minimal set obtained by adding a ‘random’ unary predicate are almost strongly minimal and model complete provided the ...
متن کاملTopological Stable Rank of H ∞ ( Ω ) for Circular Domains
— Let Ω be a circular domain, that is, an open disk with finitely many closed disjoint disks removed. Denote by H(Ω) the Banach algebra of all bounded holomorphic functions on Ω, with pointwise operations and the supremum norm. We show that the topological stable rank of H(Ω) is equal to 2. The proof is based on Suarez’s theorem that the topological stable rank of H(D) is equal to 2, where D is...
متن کاملStructures in Familiar Classes Which Have Scott Rank Ω
There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank ω CK 1 + 1. Makkai [12] produced a structure of Scott rank ω CK 1 , which can be made computable [10], and simplified so that it is just a tree [4]. In the present paper, we show that there are further computable str...
متن کاملThe small index property for ω-stable ω-categorical structures and for the random graph
We give a criterion involving existence of many generic sequences of automorphisms for a countable structure to have the small index property. We use it to show that (i) any ω-stable ω-categorical structure, and (ii) the random graph has the small index property. We also show that the automorphism group of such a structure is not the union of a countable chain of proper subgroups.
متن کاملω-Stable Theories: Introduction
1 ω Stable/Totally Transcendental Theories Throughout let T be a complete theory in a countable language L having infinite models. For an L-structure M and A ⊆ M let SM n (A) denote the set of n-types of A. We define a topology (called Stone topology) on SM n (A) by setting basic open sets to be of the form Uφ = {p ∈ SM n (A) : φ ∈ p} where φ is an L(A)-formula. Then SM n (A) is totally disconn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2003
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1091030852